The capacitated lot-sizing and energy efficient single machine scheduling problem with sequence dependent setup times and costs in a closed-loop supply chain network

In this paper, the capacitated lot-sizing and scheduling problem with sequence dependent setup times costs in a closed loop supply chain is addressed. The system utilizes closed-loop strategy so that multi-class single-level products are produced through both manufacturing of raw materials remanufacturing returned recovered products. system, single machine limited capacity each time period used to perform operations. sequence-dependent (both between two lots different classes belonging same class methods) considered. A large-bucket mixed integer programming formulation proposed for problem. This model minimizes not only costs, inventory holding backlogging over planning horizon, but also energy paid utilization compression processing times. Since NP-hard, matheuristic grey wolf optimization algorithm solve it. To evaluate efficiency algorithm, some experimental instances generated solved. obtained results show effectiveness algorithms.